On Descriptional Complexity of the Planarity Problem for Gauss Words

نویسندگان

  • Vitaliy Kurlin
  • Alexei Lisitsa
  • Igor Potapov
  • Rafiq Saleh
چکیده

In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can involve knot diagrams with arbitrarily many crossings then Gauss words will be considered as strings over an infinite (unbounded) alphabet. For establishing the upper bounds on recognition of knot properties, we study these problems in a context of automata models over an infinite alphabet.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planarity of Knots, Register Automata and LogSpace Computability

In this paper we investigate the complexity of planarity of knot diagrams encoded by Gauss words, both in terms of recognition by automata over infinite alphabets and in terms of classical logarithmic space complexity. As the main result, we show that recognition of planarity of unsigned Gauss words can be done in deterministic logarithmic space and by deterministic register automata. We also d...

متن کامل

Automata on Gauss Words

In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Due to the fact the number of crossing in knots is unbounded, the Gauss words of knot diagrams are strings over infinite (unbounded) alphabet. For establishing the lower and upper bounds on rec...

متن کامل

Literal Shuffle of Compressed Words

Straight-Line Programs (SLP) are widely used compressed representations of words. In this work we study the rational transformations and the literal shuffle of words compressed via SLP, proving that the first preserves the compression rate, while the second does not. As a consequence, we prove a tight bound for the descriptional complexity of 2D texts compressed via SLP. Finally, we observe tha...

متن کامل

A New Modification of Legendre-Gauss Collocation Method for Solving a Class of Fractional Optimal Control Problems

In this paper, the optimal conditions for fractional optimal control problems (FOCPs) were derived in which the fractional differential operators defined in terms of Caputo sense and reduces this problem to a system of fractional differential equations (FDEs) that is called twopoint boundary value (TPBV) problem. An approximate solution of this problem is constructed by using the Legendre-Gauss...

متن کامل

On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions

We consider deterministic and nondeterministic finite automata with acceptance conditions that rely on the whole history of a computation on a given word and not only on the last state of the computation under consideration. Formally, these conditions can be seen as the natural analogies of the Büchi and Muller acceptance for finite automata on infinite words. We study the computational power o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0907.4180  شماره 

صفحات  -

تاریخ انتشار 2009